翻訳と辞書 Words near each other ・ DirectBand ・ DirectBuy ・ Direct Introduction ・ Direct inward dial ・ Direct Ishq ・ Direct kernel object manipulation ・ Direct labor cost ・ Direct labour cost variance ・ Direct Legislation League ・ Direct lending ・ Direct limit ・ Direct limit of groups ・ Direct Line ・ Direct Line Group ・ Direct Line with Vladimir Putin ・ Direct linear transformation ・ Direct lobbying in the United States ・ Direct mail fundraising ・ Direct manipulation animation ・ Direct manipulation interface ・ Direct market ・ Direct market access ・ Direct marketing ・ Direct Marketing Association ・ Direct marketing association ・ Direct Marketing Association (South Africa) ・ Direct Marketing Association (UK) ・ Direct Marketing Association (United States) ・ Direct marketing educational foundation ・ Direct material price variance Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Direct linear transformation ： ウィキペディア英語版 Direct linear transformation Direct linear transformation (DLT) is an algorithm which solves a set of variables from a set of similarity relations: : $\backslash mathbf\_\; \backslash propto\; \backslash mathbf\; \backslash ,\; \backslash mathbf\_$   for $\backslash ,\; k\; =\; 1,\; \backslash ldots,\; N$ where $\backslash mathbf\_$ and $\backslash mathbf\_$ are known vectors, $\backslash ,\; \backslash propto$ denotes equality up to an unknown scalar multiplication, and $\backslash mathbf$ is a matrix (or linear transformation) which contains the unknowns to be solved. This type of relation appears frequently in projective geometry. Practical examples include the relation between 3D points in a scene and their projection onto the image plane of a pinhole camera, and homographies. == Introduction == An ordinary linear equation : $\backslash mathbf\_\; =\; \backslash mathbf\; \backslash ,\; \backslash mathbf\_$   for $\backslash ,\; k\; =\; 1,\; \backslash ldots,\; N$ can be solved, for example, by rewriting it as a matrix equation $\backslash mathbf\; =\; \backslash mathbf\; \backslash ,\; \backslash mathbf$ where matrices $\backslash mathbf$ and $\backslash mathbf$ contain the vectors $\backslash mathbf\_$ and $\backslash mathbf\_$ in their respective columns. Given that there exists a unique solution, it is given by : $\backslash mathbf\; =\; \backslash mathbf\; \backslash ,\; \backslash mathbf^\; \backslash ,\; (\backslash mathbf\; \backslash ,\; \backslash mathbf^)^\; .$ Solutions can also be described in the case that the equations are over or under determined. What makes the direct linear transformation problem distinct from the above standard case is the fact that the left and right sides of the defining equation can differ by an unknown multiplicative factor which is dependent on ''k''. As a consequence, $\backslash mathbf$ cannot be computed as in the standard case. Instead, the similarity relations are rewritten as proper linear homogeneous equations which then can be solved by a standard method. The combination of rewriting the similarity equations as homogeneous linear equations and solving them by standard methods is referred to as a direct linear transformation algorithm or DLT algorithm. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Direct linear transformation」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.